Dynamic Programming Multi-Objective Combinatorial Optimization
نویسندگان
چکیده
منابع مشابه
Multi-Objective Combinatorial Optimization: Problematic and Context
1 CINVESTAV-IPN, Departamento de Computación, Av. IPN No. 2508, Col. San Pedro Zacatenco, México, D.F. 07300, Mexico [email protected] 2 Laboratoire d’Informatique Fondamentale de Lille (LIFL), UMR CNRS 8022, Université Lille 1, Bâtiment M3, 59655 Villeneuve d’Ascq cedex, France 3 INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d’Ascq, Fran...
متن کاملDynamic Multi-Objective Optimization Using PSO
Optimisation problems occur in many situations and aspects of modern life. In reality, many of these problems are dynamic in nature, where changes can occur in the environment that influence the solutions of the optimisation problem. Many methods use a weighted average approach to the multiple objectives. However, generally a dynamic multi-objective optimisation problem (DMOOP) does not have a ...
متن کاملPerformance Measures for Dynamic Multi-Objective Optimization
As most of the performance measures proposed for dynamic optimization algorithms in the literature are only for single objective problems, we propose new measures for dynamic multi-objective problems. Specifically, we give new measures for those problems in which the Pareto fronts are unknown. As these problems are the most common in the industry, our proposed measures constitute an important c...
متن کاملMulti-Objective Optimization of Two Dynamic Systems
This paper details two problems that employ Genetic-based Multi-objective Optimization algorithms on dynamic systems. The first is a simple, single input system and the second is a complex two input system. First, the two systems are detailed with the derivation of their models. From these models, an optimization algorithm based on NSGA-II is run, constructing the Pareto Frontiers. The results ...
متن کاملAutomatic Design of Evolutionary Algorithms for Multi-Objective Combinatorial Optimization
Multi-objective evolutionary algorithms (MOEAs) have been the subject of a large research effort over the past two decades. Traditionally, these MOEAs have been seen as monolithic units, and their study was focused on comparing them as blackboxes. More recently, a component-wise view of MOEAs has emerged, with flexible frameworks combining algorithmic components from different MOEAs. The number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in systems, decision and control
سال: 2021
ISSN: ['2198-4182', '2198-4190']
DOI: https://doi.org/10.1007/978-3-030-63920-4